Contraction-free Proofs and Finitary Games for Linear Logic
نویسندگان
چکیده
منابع مشابه
Contraction-free proofs and finitary games for Linear Logic
In the standard sequent presentations of Girard’s Linear Logic [10] (LL), there are two ”non-decreasing” rules, where the premises are not smaller than the conclusion, namely the cut and the contraction rules. It is a universal concern to eliminate the cut rule. We show that, using an admissible modification of the tensor rule, contractions can be eliminated, and that cuts can be simultaneously...
متن کاملCanonical Proofs for Linear Logic Programming Frameworks
We discuss here the proof-theoretic foundations for theorem proving and logic programming in linear logic, mainly studying how to deene canonical proofs (that are complete) for eecient proof search in fragments of linear logic. We analyze the conception of such proof forms, for frameworks based on proof-construction as computation, emphasizing the relationship between the logical fragment and i...
متن کاملFinitary Semantics of Linear Logic and Higher-Order Model-Checking
In this paper, we explain how the connection between higherorder model-checking and linear logic recently exhibited by the authors leads to a new and conceptually enlightening proof of the selection problem originally established by Carayol and Serre using collapsible pushdown automata. The main idea is to start from an infinitary and colored relational semantics of the λY -calculus already for...
متن کاملLorenzen's Games and Linear Logic
This paper presents some basic notions concerning Lorenzen's game tradition and its relation with Linear Logic. It is shown that Lorenzen's idea was applied in Blass' work in order to deene a game semantics for Linear Logic. Originally Blass came-up with these ideas on 70's, however they were fully developed only in 1992. Moreover, by identifying the source of the problems in Blass' approach, A...
متن کاملCoequational Logic for Finitary Functors
Coequations, which are subsets of a cofree coalgebra, can be viewed as properties of systems. In case of a polynomial functor, a logic of coequations was formulated by J. Adámek. However, the logic is more complicated for other functors than polynomial ones, and simple deduction rules can no longer be formulated. A simpler coequational logic for finitely branching labelled transition systems wa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2009
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2009.07.095